Proactive channel agent

ABSTRACT

Automated devices send messages of a first batch sequence individually to a target queue of a receiving node of a cluster of server nodes, the messages having a different sequence number indicative of their relative positions within the batch sequence, and each is associated with a first logic unit of work identifier. In response to determining that a message counter meets a threshold, a force commit packet is generated to include the sequence number of the last batch message sent to the target queue. If the force commit packet sequence number is not the last position number within the batch sequence, a second logic unit of work identifier is associated with a subset sequence of the batch of messages having sequence numbers spanning from the first number to the force commit packet sequence number, and the subset sequence messages are committed to the receiving node target queue.

BACKGROUND

A computer cluster consists of a set of computer servers (cluster nodes)that are connected to each other through fast local area networks(“LAN”) and work together so that, in many respects, they can be viewedas a single system. Each node generally runs its own instance of anoperating system, and they may use similar or dissimilar hardware andoperating systems. Computer clusters are generally deployed to improveperformance and availability relative to the capabilities of a singlecomputer, and may be much more cost-effective than single computers ofcomparable speed or availability.

A processor configured by executing appropriate program codeinstructions may function as a message channel agent that controls thesending and receiving of messages between message engines of respectivenodes on a channel defined in a messaging computer cluster environment.Message channel agents move messages from one queue manager to another,wherein there is generally one message channel agent at each end of achannel. A channel is started on a channel initiator if it has access toa channel definition for a channel with that name. A channel definitioncan be defined to be private to a queue manager, or stored on the sharedrepository and available anywhere (a group definition). This means thata group defined channel is available on any channel initiator in aqueue-sharing group.

Messaging cluster environment structures are commonly used in enterpriseproduction environments, wherein a given application consumes messagesfrom a same cluster queue instance defined on multiple messaging enginesof the cluster nodes. Agile environments enable development of newversions of messaging applications in a short time cycles, and newversions may be deployed before they are fully tested, leading toproduction stability concerns.

BRIEF SUMMARY

In one aspect of the present invention, a computerized method for aproactive channel agent structure includes executing steps on a computerprocessor. Thus, a computer processor sends individually to a targetqueue of a receiving node of a cluster of server nodes messages of afirst batch sequence of messages, each with different sequence numbersindicative of their relative positions within the batch sequence, andwherein each of the batch sequence messages is associated with a firstlogic unit of work identifier. The processer updates a message countervalue in response to each receipt by the receiving node of one of thebatch sequence messages sent to the target queue. In response todetermining that the updated message counter value meets a thresholdlimit, the processer generates a force commit packet that includes thesequence number of the last of the batch messages sent to the targetqueue. In response to determining that the sequence number of thegenerated force commit packet data is not a last position number withinthe first batch sequence, the processer associates a second logic unitof work identifier with a subset sequence of the batch of messages thatincludes a messages having different sequence numbers spanning from afirst number to the sequence number of the generated force commit packetdata, and commits the subset sequence plurality of messages to thetarget queue of the receiving node.

In another aspect, a system has a hardware processor in circuitcommunication with a computer readable memory and a computer-readablestorage medium having program instructions stored thereon. The processorexecutes the program instructions stored on the computer-readablestorage medium via the computer readable memory and thereby sendsindividually to a target queue of a receiving node of a cluster ofserver nodes messages of a first batch sequence of messages, each withdifferent sequence numbers indicative of their relative positions withinthe batch sequence, and wherein each of the batch sequence messages isassociated with a first logic unit of work identifier. The processerupdates a message counter value in response to each receipt by thereceiving node of one of the batch sequence messages sent to the targetqueue. In response to determining that the updated message counter valuemeets a threshold limit, the processer generates a force commit packetthat includes the sequence number of the last of the batch messages sentto the target queue. In response to determining that the sequence numberof the generated force commit packet data is not a last position numberwithin the first batch sequence, the processer associates a second logicunit of work identifier with a subset sequence of the batch of messagesthat includes a messages having different sequence numbers spanning froma first number to the sequence number of the generated force commitpacket data, and commits the subset sequence plurality of messages tothe target queue of the receiving node.

In another aspect, a computer program product for a proactive channelagent structure has a computer-readable storage medium with computerreadable program code embodied therewith. The computer readable hardwaremedium is not a transitory signal per se. The computer readable programcode includes instructions for execution which cause the processor tosend individually to a target queue of a receiving node of a cluster ofserver nodes messages of a first batch sequence of messages, each withdifferent sequence numbers indicative of their relative positions withinthe batch sequence, and wherein each of the batch sequence messages isassociated with a first logic unit of work identifier. The processor iscaused to update a message counter value in response to each receipt bythe receiving node of one of the batch sequence messages sent to thetarget queue. In response to determining that the updated messagecounter value meets a threshold limit, the processor is caused togenerate a force commit packet that includes the sequence number of thelast of the batch messages sent to the target queue. In response todetermining that the sequence number of the generated force commitpacket data is not a last position number within the first batchsequence, the processor is caused to associate a second logic unit ofwork identifier with a subset sequence of the batch of messages thatincludes messages having different sequence numbers spanning from afirst number to the sequence number of the generated force commit packetdata, and commit the subset sequence plurality of messages to the targetqueue of the receiving node.

BRIEF DESCRIPTION OF THE DRAWINGS

These and other features of embodiments of the present invention will bemore readily understood from the following detailed description of thevarious aspects of the invention taken in conjunction with theaccompanying drawings in which:

FIG. 1 depicts a cloud computing environment according to an embodimentof the present invention.

FIG. 2 depicts a cloud computing node according to an embodiment of thepresent invention.

FIG. 3 depicts a computerized aspect according to an embodiment of thepresent invention.

FIG. 4 is a flow chart illustration of a process or system according toan embodiment of the present invention.

FIG. 5 is a flow chart illustration of a process or system according toanother embodiment of the present invention.

DETAILED DESCRIPTION

The present invention may be a system, a method, and/or a computerprogram product at any possible technical detail level of integration.The computer program product may include a computer readable storagemedium (or media) having computer readable program instructions thereonfor causing a processor to carry out aspects of the present invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, configuration data for integrated circuitry, oreither source code or object code written in any combination of one ormore programming languages, including an object oriented programminglanguage such as Smalltalk, C++, or the like, and procedural programminglanguages, such as the “C” programming language or similar programminglanguages. The computer readable program instructions may executeentirely on the user's computer, partly on the user's computer, as astand-alone software package, partly on the user's computer and partlyon a remote computer or entirely on the remote computer or server. Inthe latter scenario, the remote computer may be connected to the user'scomputer through any type of network, including a local area network(LAN) or a wide area network (WAN), or the connection may be made to anexternal computer (for example, through the Internet using an InternetService Provider). In some embodiments, electronic circuitry including,for example, programmable logic circuitry, field-programmable gatearrays (FPGA), or programmable logic arrays (PLA) may execute thecomputer readable program instructions by utilizing state information ofthe computer readable program instructions to personalize the electroniccircuitry, in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

It is understood in advance that although this disclosure includes adetailed description on cloud computing, implementation of the teachingsrecited herein are not limited to a cloud computing environment. Rather,embodiments of the present invention are capable of being implemented inconjunction with any other type of computing environment now known orlater developed.

Cloud computing is a model of service delivery for enabling convenient,on-demand network access to a shared pool of configurable computingresources (e.g. networks, network bandwidth, servers, processing,memory, storage, applications, virtual machines, and services) that canbe rapidly provisioned and released with minimal management effort orinteraction with a provider of the service. This cloud model may includeat least five characteristics, at least three service models, and atleast four deployment models.

Characteristics are as follows:

On-demand self-service: a cloud consumer can unilaterally provisioncomputing capabilities, such as server time and network storage, asneeded automatically without requiring human interaction with theservice's provider.

Broad network access: capabilities are available over a network andaccessed through standard mechanisms that promote use by heterogeneousthin or thick client platforms (e.g., mobile phones, laptops, and PDAs).

Resource pooling: the provider's computing resources are pooled to servemultiple consumers using a multi-tenant model, with different physicaland virtual resources dynamically assigned and reassigned according todemand. There is a sense of location independence in that the consumergenerally has no control or knowledge over the exact location of theprovided resources but may be able to specify location at a higher levelof abstraction (e.g., country, state, or datacenter).

Rapid elasticity: capabilities can be rapidly and elasticallyprovisioned, in some cases automatically, to quickly scale out andrapidly released to quickly scale in. To the consumer, the capabilitiesavailable for provisioning often appear to be unlimited and can bepurchased in any quantity at any time.

Measured service: cloud systems automatically control and optimizeresource use by leveraging a metering capability at some level ofabstraction appropriate to the type of service (e.g., storage,processing, bandwidth, and active user accounts). Resource usage can bemonitored, controlled, and reported providing transparency for both theprovider and consumer of the utilized service.

Service Models are as follows:

Software as a Service (SaaS): the capability provided to the consumer isto use the provider's applications running on a cloud infrastructure.The applications are accessible from various client devices through athin client interface such as a web browser (e.g., web-based e-mail).The consumer does not manage or control the underlying cloudinfrastructure including network, servers, operating systems, storage,or even individual application capabilities, with the possible exceptionof limited user-specific application configuration settings.

Platform as a Service (PaaS): the capability provided to the consumer isto deploy onto the cloud infrastructure consumer-created or acquiredapplications created using programming languages and tools supported bythe provider. The consumer does not manage or control the underlyingcloud infrastructure including networks, servers, operating systems, orstorage, but has control over the deployed applications and possiblyapplication hosting environment configurations.

Infrastructure as a Service (IaaS): the capability provided to theconsumer is to provision processing, storage, networks, and otherfundamental computing resources where the consumer is able to deploy andrun arbitrary software, which can include operating systems andapplications. The consumer does not manage or control the underlyingcloud infrastructure but has control over operating systems, storage,deployed applications, and possibly limited control of select networkingcomponents (e.g., host firewalls).

Deployment Models are as follows:

Private cloud: the cloud infrastructure is operated solely for anorganization. It may be managed by the organization or a third party andmay exist on-premises or off-premises.

Community cloud: the cloud infrastructure is shared by severalorganizations and supports a specific community that has shared concerns(e.g., mission, security requirements, policy, and complianceconsiderations). It may be managed by the organizations or a third partyand may exist on-premises or off-premises.

Public cloud: the cloud infrastructure is made available to the generalpublic or a large industry group and is owned by an organization sellingcloud services.

Hybrid cloud: the cloud infrastructure is a composition of two or moreclouds (private, community, or public) that remain unique entities butare bound together by standardized or proprietary technology thatenables data and application portability (e.g., cloud bursting forload-balancing between clouds).

A cloud computing environment is service oriented with a focus onstatelessness, low coupling, modularity, and semantic interoperability.At the heart of cloud computing is an infrastructure comprising anetwork of interconnected nodes.

Referring now to FIG. 1, illustrative cloud computing environment 50 isdepicted. As shown, cloud computing environment 50 comprises one or morecloud computing nodes 10 with which local computing devices used bycloud consumers, such as, for example, personal digital assistant (PDA)or cellular telephone 54A, desktop computer 54B, laptop computer 54C,and/or automobile computer system 54N may communicate. Nodes 10 maycommunicate with one another. They may be grouped (not shown) physicallyor virtually, in one or more networks, such as Private, Community,Public, or Hybrid clouds as described hereinabove, or a combinationthereof. This allows cloud computing environment 50 to offerinfrastructure, platforms and/or software as services for which a cloudconsumer does not need to maintain resources on a local computingdevice. It is understood that the types of computing devices 54A-N shownin FIG. 1 are intended to be illustrative only and that computing nodes10 and cloud computing environment 50 can communicate with any type ofcomputerized device over any type of network and/or network addressableconnection (e.g., using a web browser).

Referring now to FIG. 2, a set of functional abstraction layers providedby cloud computing environment 50 (FIG. 1) is shown. It should beunderstood in advance that the components, layers, and functions shownin FIG. 2 are intended to be illustrative only and embodiments of theinvention are not limited thereto. As depicted, the following layers andcorresponding functions are provided:

Hardware and software layer 60 includes hardware and softwarecomponents. Examples of hardware components include: mainframes 61; RISC(Reduced Instruction Set Computer) architecture based servers 62;servers 63; blade servers 64; storage devices 65; and networks andnetworking components 66. In some embodiments, software componentsinclude network application server software 67 and database software 68.

Virtualization layer 70 provides an abstraction layer from which thefollowing examples of virtual entities may be provided: virtual servers71; virtual storage 72; virtual networks 73, including virtual privatenetworks; virtual applications and operating systems 74; and virtualclients 75.

In one example, management layer 80 may provide the functions describedbelow. Resource provisioning 81 provides dynamic procurement ofcomputing resources and other resources that are utilized to performtasks within the cloud computing environment. Metering and Pricing 82provide cost tracking as resources are utilized within the cloudcomputing environment, and billing or invoicing for consumption of theseresources. In one example, these resources may comprise applicationsoftware licenses. Security provides identity verification for cloudconsumers and tasks, as well as protection for data and other resources.User portal 83 provides access to the cloud computing environment forconsumers and system administrators. Service level management 84provides cloud computing resource allocation and management such thatrequired service levels are met. Service Level Agreement (SLA) planningand fulfillment 85 provide pre-arrangement for, and procurement of,cloud computing resources for which a future requirement is anticipatedin accordance with an SLA.

Workloads layer 90 provides examples of functionality for which thecloud computing environment may be utilized. Examples of workloads andfunctions which may be provided from this layer include: mapping andnavigation 91; software development and lifecycle management 92; virtualclassroom education delivery 93; data analytics processing 94;transaction processing 95; and processing 96 according to embodiments ofthe present invention, for example to execute the process steps orsystem components or tasks as depicted in FIG. 4 or FIG. 5 below.

FIG. 3 is a schematic of an example of a programmable deviceimplementation 10 according to an aspect of the present invention, whichmay function as a cloud computing node within the cloud computingenvironment of FIG. 2. Programmable device implementation 10 is only oneexample of a suitable implementation and is not intended to suggest anylimitation as to the scope of use or functionality of embodiments of theinvention described herein. Regardless, programmable deviceimplementation 10 is capable of being implemented and/or performing anyof the functionality set forth hereinabove.

A computer system/server 12 is operational with numerous other generalpurpose or special purpose computing system environments orconfigurations. Examples of well-known computing systems, environments,and/or configurations that may be suitable for use with computersystem/server 12 include, but are not limited to, personal computersystems, server computer systems, thin clients, thick clients, hand-heldor laptop devices, multiprocessor systems, microprocessor-based systems,set top boxes, programmable consumer electronics, network PCs,minicomputer systems, mainframe computer systems, and distributed cloudcomputing environments that include any of the above systems or devices,and the like.

Computer system/server 12 may be described in the general context ofcomputer system-executable instructions, such as program modules, beingexecuted by a computer system. Generally, program modules may includeroutines, programs, objects, components, logic, data structures, and soon that perform particular tasks or implement particular abstract datatypes. Computer system/server 12 may be practiced in distributed cloudcomputing environments where tasks are performed by remote processingdevices that are linked through a communications network. In adistributed cloud computing environment, program modules may be locatedin both local and remote computer system storage media including memorystorage devices.

The computer system/server 12 is shown in the form of a general-purposecomputing device. The components of computer system/server 12 mayinclude, but are not limited to, one or more processors or processingunits 16, a system memory 28, and a bus 18 that couples various systemcomponents including system memory 28 to processor 16.

Bus 18 represents one or more of any of several types of bus structures,including a memory bus or memory controller, a peripheral bus, anaccelerated graphics port, and a processor or local bus using any of avariety of bus architectures. By way of example, and not limitation,such architectures include Industry Standard Architecture (ISA) bus,Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, VideoElectronics Standards Association (VESA) local bus, and PeripheralComponent Interconnects (PCI) bus.

Computer system/server 12 typically includes a variety of computersystem readable media. Such media may be any available media that isaccessible by computer system/server 12, and it includes both volatileand non-volatile media, removable and non-removable media.

System memory 28 can include computer system readable media in the formof volatile memory, such as random access memory (RAM) 30 and/or cachememory 32. Computer system/server 12 may further include otherremovable/non-removable, volatile/non-volatile computer system storagemedia. By way of example only, storage system 34 can be provided forreading from and writing to a non-removable, non-volatile magnetic media(not shown and typically called a “hard drive”). Although not shown, amagnetic disk drive for reading from and writing to a removable,non-volatile magnetic disk (e.g., a “floppy disk”), and an optical diskdrive for reading from or writing to a removable, non-volatile opticaldisk such as a CD-ROM, DVD-ROM or other optical media can be provided.In such instances, each can be connected to bus 18 by one or more datamedia interfaces. As will be further depicted and described below,memory 28 may include at least one program product having a set (e.g.,at least one) of program modules that are configured to carry out thefunctions of embodiments of the invention.

Program/utility 40, having a set (at least one) of program modules 42,may be stored in memory 28 by way of example, and not limitation, aswell as an operating system, one or more application programs, otherprogram modules, and program data. Each of the operating system, one ormore application programs, other program modules, and program data orsome combination thereof, may include an implementation of a networkingenvironment. Program modules 42 generally carry out the functions and/ormethodologies of embodiments of the invention as described herein.

Computer system/server 12 may also communicate with one or more externaldevices 14 such as a keyboard, a pointing device, a display 24, etc.;one or more devices that enable a user to interact with computersystem/server 12; and/or any devices (e.g., network card, modem, etc.)that enable computer system/server 12 to communicate with one or moreother computing devices. Such communication can occur via Input/Output(I/O) interfaces 22. Still yet, computer system/server 12 cancommunicate with one or more networks such as a local area network(LAN), a general wide area network (WAN), and/or a public network (e.g.,the Internet) via network adapter 20. As depicted, network adapter 20communicates with the other components of computer system/server 12 viabus 18. It should be understood that although not shown, other hardwareand/or software components could be used in conjunction with computersystem/server 12. Examples, include, but are not limited to: microcode,device drivers, redundant processing units, external disk drive arrays,RAID systems, tape drives, and data archival storage systems, etc.

FIG. 4 illustrates a process or system for a proactive channel agentstructure according to the present invention. A server processorconfigured by executing program code instructions according to thepresent invention (the “configured processor) functions as proactivechannel agent of a first, sending node within a messaging computercluster plurality of nodes. At 102 the sending node proactive channelagent associates a first Logic Unit of Work Identifier (for example,“LUWID1”) to each message of a plurality of a first channel batch ofmessages (the LUWID1 channel batch) destined for sending over a messagechannel to a target queue (for example, a “TargetQueue” field) ofanother, different (second) receiving node of the cluster.

The first channel batch is a logical unit of work defined for reliablemessage transfer confirmation, wherein a given message within the firstbatch is not visible for a consumer application to get until the entirebatch is committed. The channel used is defined within an environment ofthe cluster for sending messages from other cluster nodes to the targetqueue field of the second node. The batch size (number of messages) isdefined for the cluster environment: in one example fifty (50) messages,though other batch sizes may be practiced according to the presentinvention.

At 104 the proactive channel agent of the sending node sends messages ofthe first channel batch on a sequential, individual basis (one at atime) to the target queue of the second, receiving node, wherein each isidentified with respect to its position in the channel batch sequencewith a unique sequence number. For example, the value of a “SeqInBatch”field may be chosen from the set of one through fifty for a batch offifty messages.

At 106 a server processor configured to function as a proactive channelagent according to the present invention for the receiving node indexesor otherwise updates a message counter (for example, a “MsgCounter”field) associated with a node control structure field (for example, a“NodeControlStruct” field) of the target queue each time it receives asingle message of the first channel batch directed to the target queue.

In response to determining at 108 that the value of the message countermeets a threshold limit defined for the target queue (for example, a“MsgNumLimit” field), at 110 the receiving node channel agent generatesand sends a “force-commit” packet back to the sending node proactivechannel agent that indicates the sequence number of the channel batchmessage last sent to the target queue as a subset of the first channelbatch it wants to commit. For example, a “SeqInBatch=40” is sent back inthe force-commit packet if the fortieth of the sequence of channel batchmessages sent to the target queue resulted in “MsgCounter=MsgNumLimit.”In one example the MsgNumLimit value is one thousand (1,000), thoughother values may be practiced.

In response to determining at 112 that the last of the first channelbatch messages has been sequentially sent to the target queue of thesecond node (for example, SeqInBatch=50), at 114 the sending nodeproactive channel agent makes a non-blocking “receive from” call (“recv()”) to read any buffered “force-commit” packet data sent by thereceiving node proactive channel agent, which would include onegenerated or sent at 110.

In response to determining at 116 that no buffered force commit packageis found from the receiving node agent, or that the sequence number of afound buffered force commit package is the last of an entirety of thefirst batch messages, at 118 the sending node proactive channel agentsends a batch confirm request to the receiving node agent for the entirefirst channel batch, in order to commit the entire batch in response toa confirmation reply from the receiving channel agent at 120.

Otherwise, in response to determining at 116 that a found buffered forcecommit package comprises a sequence number of the last received messagethat is not the last sequence number of the first batch of messages(thus, that less than an entirety of the first batch messages was sent),at 122 the sending node proactive channel agent de-associates all of the(in this example, fifty) first channel batch messages from the firstlogic unit of work identifier (in this example, “LUWID1”), marks them asrolled back at 124, and at 126 assigns a new LUWID (for example,“LUWID2”) to the sequence subset identified in the force-commit packetdata (in this example, the first 40 messages of the original firstchannel batch) and commits said subset with the new LUWID to the targetqueue of the receiving node.

At 128 the sending node proactive channel agent continues sending othermessages for the target queue of the second, receiving node (includingthe last ten messages of said first channel batch that were notcommitted at 122) by either rerouting them to other message engines ofother nodes that are available within the cluster (their node controlstate field values are not set to the limit-reached value), or byputting them in a pause queue (for example, to a “PauseQueue” field) orother buffer structure if no other node message engines are availablefor re-routing.

FIG. 5 illustrates another, different embodiment according to thepresent invention that incorporates node controllers within clusternodes that are in communication with a central controller server. At 202a server processor configured by executing program code instructions(the “configured processor”) provides a proactive channel agent of asending, first node within a messaging computer cluster plurality ofnodes that associates a unique logic unit of work identifier with eachmessage of a plurality of a first channel batch of messages destined forsending over a message channel to a target queue of another, receivingnode of the cluster.

At 204 the sending node proactive channel agent sends messages of thefirst channel batch on a sequential, individual basis (one at a time) tothe target queue of the second, receiving node, each is identified witha unique sequence number.

At 206 a server processor of the other receiving node functions as aproactive channel agent and updates a message counter for the targetqueue each time it receives a single message of the first channel batchdirected to the target queue.

In response to determining at 208 that the value of the message countermeets a threshold limit defined for the target queue, at 210 thereceiving node proactive channel agent sends a “force-commit” packetback to the sending node proactive channel agent that indicates thesequence number of the channel batch message last sent to the targetqueue that it wants to commit; sets the value of a node control statefield of the receiving node to a limit-reached value that indicates thatthe commit threshold has been reached for the node (for example,“NodeControlState={(TargetQueue, REACH_LIMIT)}), and sends thelimit-reached value to a central controller node of the clusterenvironment (another server having a processor configured by executingprogram code instructions according to the present invention to serveras a central controller node) to update the central controller of thereceiving status of the target queue of the second, receiving node.

At 212 the central controller determines whether the message counterreached the threshold limit within a specified interval time period. Forexample, determining whether a time value associated with the messagereceipt triggering the threshold limit value falls within a specifiedinterval time period defined from a starting time (value within a“TimeS” field) to an ending time equal to the TimeS value plus an ending“TimeE” field value. If not, then the time interval has elapsed and thecentral controller resets the message counter to zero in associationwith a new TimeS value set to the current network time, resets the valueof the node control state field of the receiving node from thelimit-reached value to an available value (for example, “{(TargetQueue,AVAILABLE)}”).

At 214 the central controller informs (updates) all of the other nodesof the current (updated) limit-reached value of the node control statefield of the receiving node, wherein the other nodes may responsivelyhalt transmissions of messages to the target queue of the receivingsecond node in response to a setting of the value of the node controlstate field of the receiving node to the limit-reached value.

Thus, at 216, in response to determining that the last of the firstchannel batch messages has been sequentially sent to the target queue ofthe second node, or that the value of the node control state field ofthe receiving node is set (updated) to the limit-reached value, thecurrent example moves on to step 116 of the process illustrated in FIG.4 and discussed above.

It is known in the prior art for an application to send batches ofmessages grouped by logic unit of work identifier (LUWID) affinities toa queue manager. The prior art queue manager may fail to receivemessages after receiving only part of the batch, wherein a sending queuemanager must wait for it to recover and process the incomplete messagebatch before it can send any more messages. A batch of messages withsuch affinities can lock resources at the destination queue managerwhile waiting for subsequent messages. These resources might remainlocked for long periods of time, preventing other applications fromdoing their work.

By providing for automated mechanisms to remove and replace LUWIDmessage affinities aspects of the present invention free up sendingqueue managers to send more messages, and also improve the scalabilityof applications. Aspects also teach a method to control numbers ofmessages arriving on receiver queues accurately as a function of regularinterval boundaries.

As discussed generally in the Background section above, new versions ofmessaging applications deployed on messaging engines of cluster nodesbefore they are fully tested may lead to production stability concerns.Aspects of the present invention enable enterprise clients to minimizethe impact of deploying problematic new versions in messaging clusterproduction environments, by deploying new versions of a messagingapplication on limited numbers of nodes and using the proactive batchcommit processes described above to limit numbers of messages arrivingon a target queue for such nodes on timely basis. This enables serviceproviders to identify and correct problems caused by the deployment ofthe new versions prior to propagating the new versions to other nodeswithin the cluster, proportionately reducing impacts on productioncaused by the identified problems, and then to gradually increasemessage transmissions using the new versions until full workloadcapacity may be supported by the new versions.

In a Messaging-as-a-Service environment service providers may charge forservices on a per message number basis, wherein each message indicatesone transaction request, in contrast to charging on a size of message(for example, bytes) basis. Controlling the number of messages handledby utilizing aspects of the present invention can help in controllingthe provision and the quality of such messaging services.

While business messages for a target queue are transferred individuallythrough a defined cluster channel, each transferred message is part of alogical unit of work and needs to be committed, or backed out, as achannel batch. The channel batch methods and processes of the presentinvention provide efficient solutions for controlling the number ofmessages arriving on a receiver queue accurately, and on a regular,interval basis.

Clustering environment management may use alternative target queueparameters approaches. For example, “CLWLWGHT” is a cluster workloadweight parameter or attribute that applies a weighting factor to achannel so a ratio (proportion) of messages sent on a channel to a sameclustered receiver on a different queue manager queue can be controlled.However, business workloads may vary greatly between different nodequeue managers, or between peak and off-peak times, making proportionatemessage control difficult or inconsistent with respect to numbers ofmessages controlled relative to different nodes or timeframes.

The terminology used herein is for describing particular aspects onlyand is not intended to be limiting of the invention. As used herein, thesingular forms “a”, “an” and “the” are intended to include the pluralforms as well, unless the context clearly indicates otherwise. It willbe further understood that the terms “include” and “including” when usedin this specification specify the presence of stated features, integers,steps, operations, elements, and/or components, but do not preclude thepresence or addition of one or more other features, integers, steps,operations, elements, components, and/or groups thereof. Certainexamples and elements described in the present specification, includingin the claims and as illustrated in the figures, may be distinguished orotherwise identified from others by unique adjectives (e.g. a “first”element distinguished from another “second” or “third” of a plurality ofelements, a “primary” distinguished from a “secondary” one or “another”item, etc.) Such identifying adjectives are generally used to reduceconfusion or uncertainty, and are not to be construed to limit theclaims to any specific illustrated element or embodiment, or to implyany precedence, ordering or ranking of any claim elements, limitationsor process steps.

The descriptions of the various embodiments of the present inventionhave been presented for purposes of illustration, but are not intendedto be exhaustive or limited to the embodiments disclosed. Manymodifications and variations will be apparent to those of ordinary skillin the art without departing from the scope and spirit of the describedembodiments. The terminology used herein was chosen to best explain theprinciples of the embodiments, the practical application or technicalimprovement over technologies found in the marketplace, or to enableothers of ordinary skill in the art to understand the embodimentsdisclosed herein.

What is claimed is:
 1. A computer-implemented method for a proactivechannel agent structure, comprising executing on a computer processorthe steps of: sending individually, to a target queue of a receivingnode of a cluster plurality of server nodes, messages of a first batchsequence plurality of messages, each with different sequence numbersindicative of their relative positions within the first batch sequence,wherein each of the first batch sequence plurality of messages isassociated with a first logic unit of work identifier; updating amessage counter value in response to each receipt by the receiving nodeof one of the first batch sequence plurality of messages sent to thetarget queue; in response to determining that the updated messagecounter value meets a threshold limit, generating a force commit packetcomprising the sequence number of a last one of the batch messages sentto the target queue; and in response to determining that the sequencenumber of the generated force commit packet data is not a last positionnumber within the first batch sequence, associating a second logic unitof work identifier with a subset sequence plurality of the first batchmessages that comprises a plurality of the batch messages havingdifferent sequence numbers spanning from a first of the sequence numbersto the sequence number of the generated force commit packet data, andcommitting the subset sequence plurality of messages to the target queueof the receiving node, wherein the second logic unit of work identifieris different from the first logic unit of work identifier.
 2. The methodof claim 1, further comprising: in response to determining that thesequence number of the generated force commit packet data is not thelast position number within the first batch sequence, de-associating allof the first batch messages from the first logic unit of workidentifier, marking all of the first batch messages as rolled back, andassigning the second logic unit of work identifier to the subsetsequence plurality of messages marked as rolled back.
 3. The method ofclaim 1, further comprising: in response to determining that a last ofthe first batch messages has been sequentially sent to the receivingnode target queue, making a non-blocking receive-from call; readingbuffered force-commit packet data returned from the non-blockingreceive-from call; and determining that the sequence number of thegenerated force commit packet data is not the last position numberwithin the first batch sequence as a function of reading the sequencenumber of the read force commit packet data from data returned from thenon-blocking receive-from call.
 4. The method of claim 1, furthercomprising: sending a remainder of the messages of the first batchplurality that each have sequence numbers greater than the sequencenumber of the generated force commit packet data to an alternativedestination that is selected from the group consisting of a pause queue,and a target queue of another node of the cluster of nodes that isindicated as available for receiving messages for the target queue. 5.The method of claim 1, further comprising: in response to determiningthat the updated message counter value meets the threshold limit,setting the value of a node control state field for the receiving nodewithin a central controller node to a limit-reached value; updatingother nodes of the cluster inclusive of the sending node with thelimit-reached value for the node control state field of the receivingnode; and generating the force commit packet in response to updating thesending node with the limit-reached value for the node control statefield of the receiving node.
 6. The method of claim 5, furthercomprising: in response to determining that the message counter did notreach the threshold limit within a specified interval time period froman initialization of the message counter to zero, updating the othernodes of the cluster inclusive of the sending node with an availablevalue for the node control state field of the receiving node.
 7. Themethod of claim 1, further comprising: integrating computer-readableprogram code into a computer system comprising a processor, a computerreadable memory in circuit communication with the processor, and acomputer readable storage medium in circuit communication with theprocessor; and wherein the processor executes program code instructionsstored on the computer-readable storage medium via the computer readablememory and thereby performs the steps of sending the messages of thefirst batch sequence plurality of messages individually with thedifferent sequence numbers to the target queue of the receiving node,each associated with the first logic unit of work identifier, updatingthe message counter value in response to each receipt by the receivingnode of one of the first batch sequence messages sent to the targetqueue, generating the force commit packet in response to determiningthat the updated message counter value meets the threshold limit, and inresponse to determining that the sequence number of the generated forcecommit packet data is not the last position number within the firstbatch sequence, associating the second logic unit of work identifierwith the subset sequence plurality of the first batch messages andcommitting the subset sequence plurality of messages to the target queueof the receiving node.
 8. The method of claim 7, wherein thecomputer-readable program code is provided as a service in a cloudenvironment.
 9. A system, comprising: a processor; a computer readablememory in circuit communication with the processor; and a computerreadable storage medium in circuit communication with the processor;wherein the processor executes program instructions stored on thecomputer-readable storage medium via the computer readable memory andthereby: sends individually, to a target queue of a receiving node of acluster plurality of server nodes, messages of a first batch sequenceplurality of messages, each with different sequence numbers indicativeof their relative positions within the first batch sequence, whereineach of the first batch sequence plurality of messages is associatedwith a first logic unit of work identifier; updates a message countervalue in response to each receipt by the receiving node of one of thefirst batch sequence plurality of messages sent to the target queue; inresponse to determining that the updated message counter value meets athreshold limit, generates a force commit packet comprising the sequencenumber of a last one of the batch messages sent to the target queue; andin response to determining that the sequence number of the generatedforce commit packet data is not a last position number within the firstbatch sequence, associates a second logic unit of work identifier with asubset sequence plurality of the first batch messages that comprises aplurality of the batch messages having different sequence numbersspanning from a first of the sequence numbers to the sequence number ofthe generated force commit packet data, and commits the subset sequenceplurality of messages to the target queue of the receiving node, whereinthe second logic unit of work identifier is different from the firstlogic unit of work identifier.
 10. The system of claim 9, wherein theprocessor executes the program instructions stored on thecomputer-readable storage medium via the computer readable memory andthereby further: in response to determining that the sequence number ofthe generated force commit packet data is not the last position numberwithin the first batch sequence, de-associates all of the first batchmessages from the first logic unit of work identifier, marks all of thefirst batch messages as rolled back, and assigns the second logic unitof work identifier to the subset sequence plurality of messages markedas rolled back.
 11. The system of claim 9, wherein the processorexecutes the program instructions stored on the computer-readablestorage medium via the computer readable memory and thereby further: inresponse to determining that a last of the first batch messages has beensequentially sent to the receiving node target queue, makes anon-blocking receive-from call; reads buffered force-commit packet datareturned from the non-blocking receive-from call; and determines thatthe sequence number of the generated force commit packet data is not thelast position number within the first batch sequence as a function ofreading the sequence number of the read force commit packet data fromdata returned from the non-blocking receive-from call.
 12. The system ofclaim 9, wherein the processor executes the program instructions storedon the computer-readable storage medium via the computer readable memoryand thereby further: sends a remainder of the messages of the firstbatch plurality that each have sequence numbers greater than thesequence number of the generated force commit packet data to analternative destination that is selected from the group consisting of apause queue, and a target queue of another node of the cluster of nodesthat is indicated as available for receiving messages for the targetqueue.
 13. The system of claim 9, wherein the processor executes theprogram instructions stored on the computer-readable storage medium viathe computer readable memory and thereby further: in response todetermining that the updated message counter value meets the thresholdlimit, sets the value of a node control state field for the receivingnode within a central controller node to a limit-reached value; updatesother nodes of the cluster inclusive of the sending node with thelimit-reached value for the node control state field of the receivingnode; and generates the force commit packet in response to updating thesending node with the limit-reached value for the node control statefield of the receiving node.
 14. The system of claim 13, wherein theprocessor executes the program instructions stored on thecomputer-readable storage medium via the computer readable memory andthereby further: in response to determining that the message counter didnot reach the threshold limit within a specified interval time periodfrom an initialization of the message counter to zero, updates the othernodes of the cluster inclusive of the sending node with an availablevalue for the node control state field of the receiving node.
 15. Acomputer program product for a proactive channel agent structure, thecomputer program product comprising: a computer readable storage mediumhaving computer readable program code embodied therewith, wherein thecomputer readable storage medium is not a transitory signal per se, thecomputer readable program code comprising instructions for execution bya processor that cause the processor to: send individually, to a targetqueue of a receiving node of a cluster plurality of server nodes,messages of a first batch sequence plurality of messages, each withdifferent sequence numbers indicative of their relative positions withinthe first batch sequence, wherein each of the first batch sequenceplurality of messages is associated with a first logic unit of workidentifier; update a message counter value in response to each receiptby the receiving node of one of the first batch sequence plurality ofmessages sent to the target queue; in response to determining that theupdated message counter value meets a threshold limit, generate a forcecommit packet comprising the sequence number of a last one of the batchmessages sent to the target queue; and in response to determining thatthe sequence number of the generated force commit packet data is not alast position number within the first batch sequence, associate a secondlogic unit of work identifier with a subset sequence plurality of thefirst batch messages that comprises a plurality of the batch messageshaving different sequence numbers spanning from a first of the sequencenumbers to the sequence number of the generated force commit packetdata, and commit the subset sequence plurality of messages to the targetqueue of the receiving node, wherein the second logic unit of workidentifier is different from the first logic unit of work identifier.16. The computer program product of claim 15, wherein the computerreadable program code instructions for execution by the processorfurther cause the processor to: in response to determining that thesequence number of the generated force commit packet data is not thelast position number within the first batch sequence, de-associate allof the first batch messages from the first logic unit of workidentifier, mark all of the first batch messages as rolled back, andassign the second logic unit of work identifier to the subset sequenceplurality of messages marked as rolled back.
 17. The computer programproduct of claim 15, wherein the computer readable program codeinstructions for execution by the processor further cause the processorto: in response to determining that a last of the first batch messageshas been sequentially sent to the receiving node target queue, make anon-blocking receive-from call; read buffered force-commit packet datareturned from the non-blocking receive-from call; and determine that thesequence number of the generated force commit packet data is not thelast position number within the first batch sequence as a function ofreading the sequence number of the read force commit packet data fromdata returned from the non-blocking receive-from call.
 18. The computerprogram product of claim 15, wherein the computer readable program codeinstructions for execution by the processor further cause the processorto: send a remainder of the messages of the first batch plurality thateach have sequence numbers greater than the sequence number of thegenerated force commit packet data to an alternative destination that isselected from the group consisting of a pause queue, and a target queueof another node of the cluster of nodes that is indicated as availablefor receiving messages for the target queue.
 19. The computer programproduct of claim 15, wherein the computer readable program codeinstructions for execution by the processor further cause the processorto: in response to determining that the updated message counter valuemeets the threshold limit, set the value of a node control state fieldfor the receiving node within a central controller node to alimit-reached value; update other nodes of the cluster inclusive of thesending node with the limit-reached value for the node control statefield of the receiving node; and generate the force commit packet inresponse to updating the sending node with the limit-reached value forthe node control state field of the receiving node.
 20. The computerprogram product of claim 19, wherein the computer readable program codeinstructions for execution by the processor further cause the processorto: in response to determining that the message counter did not reachthe threshold limit within a specified interval time period from aninitialization of the message counter to zero, update the other nodes ofthe cluster inclusive of the sending node with an available value forthe node control state field of the receiving node.